ACM Home Page
Please provide us with feedback. Feedback
Measuring the effects of preprocessing decisions and network forces in dynamic network analysis
Full text MovMov (15:39),  PdfPdf (1.09 MB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Research track papers table of contents
Pages 747-756  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Jerry Scripps  Michigan State University, E. Lansing, MI, USA
Pang-Ning Tan  Michigan State University, E. Lansing, MI, USA
Abdol-Hossein Esfahanian  Michigan State University, E. Lansing, MI, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 43,   Downloads (12 Months): 152,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557019.1557102
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

Social networks have become a major focus of research in recent years, initially directed towards static networks but increasingly, towards dynamic ones. In this paper, we investigate how different pre-processing decisions and different network forces such as selection and influence affect the modeling of dynamic networks. We also present empirical justification for some of the modeling assumptions made in dynamic network analysis (e.g., first-order Markovian assumption) and develop metrics to measure the alignment between links and attributes under different strategies of using the historical network data. We also demonstrate the effect of attribute drift, that is, the importance of individual attributes in forming links change over time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
A.-L. Barabasi and E. Bonabeau. Scale-free networks. Scientific American, 288:50--59, May 2003.
 
4
S. P. Borgatti and M. G. Everett. Models of core / periphery structures. Social Networks, 21:375--395, 1999.
5
 
6
P. ErdÄos and A. Renyi. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17--61, 1960.
 
7
T. Frantz and K. M. Carley. A formal characterization of cellular networks. Technical Report CMU-ISRI-05-109, Carnegie Mellon University, 2005.
 
8
C. Guestrin, D. Koller, C. Gearhart, and Neal Kanodia. Generalizing plans to new environments in relational mdps. In International Joint Conference on Artificial Intelligence, 2003.
 
9
S. Hanneke and E. Xing. Discrete temporal models of social networks. In Proceedings of the 23rd International Conference on Machine Learning Workshop on Statistical Network Analysis, 2006.
 
10
M. Al Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In Proceedings of SDM'06: SIAM Data Mining Conference Workshop on Link Analysis, Counter-terrorism and Security, 2006.
 
11
Kansas event data system. http://web.ku.edu/keds.
12
 
13
M. Lahiri and T. Y. Berger-Wolf. Structure prediction in temporal networks using frequent subgraphs. In IEEE Symposium on Computational Intelligence and Data Mining (CIDM), 2007.
14
15
 
16
J. McPherson, L. Smith-Lovin, and J. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27:415--444, 2001.
 
17
18
 
19
M. Pearson, C. Steglich, and T. Snijders. Homophily and assimilation among sport-active adolescent substance users. Connections, 27:47--63, 2006.
 
20
A. Popescul and L. H. Ungar. Statistical relational learning for link prediction. In Proceedings of the IJCAI Workshop on Learning Statistical Models from Relational Data, 2003.
21
 
22
J. Scripps, P. N. Tan, and A-H Esfahanian. A matrix alignment approach for link prediction. In Proceedings of the Nineteenth international conference on pattern recognition, 2008.
 
23
 
24
T. Snijders. Models for longitudinal network data. In P. Carrinton, J. Scott, and S. Wasserman, editors, Models and methods in social network analysis. Cambridge University Press, 2004.
 
25
B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI02), 2002.
 
26
B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In Neural Information Processing Systems Conference (NIPS03), 2003.
 
27
Siena network statistical analysis program. http://stat.gamma.rug.nl/snijders/siena.html.
 
28
S. Wasserman and P. Pattison. Logit models and logistic regression for social networks: I an introduction to markov graphs and p*. Psychometrika, 61:401--425, 1996.
 
29
D. J. Watts and S. H. Strogatz. Collective dynamics of small-world networks. Nature, pages 440--442, Jun 1998.

Collaborative Colleagues:
Jerry Scripps: colleagues
Pang-Ning Tan: colleagues
Abdol-Hossein Esfahanian: colleagues